## Uses of Class
oracle.pgx.api.filter.GraphFilter

- Packages that use GraphFilter
  Package | Description
  --- | ---
  oracle.pgx.api | This package contains the Java APIs of PGX.
  oracle.pgx.api.filter |

- - ### Uses of GraphFilter in oracle.pgx.api

    Methods in oracle.pgx.api with parameters of type GraphFilter
    Modifier and Type | Method and Description
    --- | ---
    `PgxGraph` | PgxGraph.`filter(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName)` Blocking version of `#filterAsync()`.
    `PgxGraph` | PgxGraph.`filter(GraphFilter graphFilter)` Blocking version of `#filterAsync()`.
    `PgxGraph` | PgxGraph.`filter(GraphFilter graphFilter, String newGraphName)` Blocking version of `#filterAsync()`.
    `PgxFuture<PgxGraph>` | PgxGraph.`filterAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName)` Create a subgraph of a graph.
    `PgxFuture<PgxGraph>` | PgxGraph.`filterAsync(GraphFilter graphFilter)` Create a subgraph of a graph.
    `PgxFuture<PgxGraph>` | PgxGraph.`filterAsync(GraphFilter graphFilter, String newGraphName)` Create a subgraph of a graph.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr)` Convenience wrapper around `Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)` taking vertex IDs instead of `PgxVertex`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr)` Convenience wrapper around `Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)` taking vertex IDs instead of `PgxVertex`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraBidirectionalAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.

  - ### Uses of GraphFilter in oracle.pgx.api.filter

    Subclasses of GraphFilter in oracle.pgx.api.filter
    Modifier and Type | Class and Description
    --- | ---
    `class` | `BinaryGraphFilterOperation`
    `class` | `EdgeFilter` A class that wraps a filter expression supposed to be evaluated on each edge of the graph
    `class` | `FilterIntersection` A class that represents an intersection between two graph-filters
    `class` | `FilterUnion` A class that represents an union between two graph-filters
    `class` | `GraphFilterWithExpression`
    `class` | `VertexFilter` A class that wraps a filter expression supposed to be evaluated on each vertex of the graph

    Methods in oracle.pgx.api.filter that return GraphFilter
    Modifier and Type | Method and Description
    --- | ---
    `static GraphFilter` | BinaryGraphFilterOperation.`fromTypeAndFilters(FilterType type, GraphFilter leftFilter, GraphFilter rightFilter)`
    `GraphFilter` | BinaryGraphFilterOperation.`getLeftFilter()` Gets the filter object representing the left side of the operation.
    `GraphFilter` | BinaryGraphFilterOperation.`getRightFilter()` Gets the filter object representing the right side of the operation.

    Methods in oracle.pgx.api.filter with parameters of type GraphFilter
    Modifier and Type | Method and Description
    --- | ---
    `static GraphFilter` | BinaryGraphFilterOperation.`fromTypeAndFilters(FilterType type, GraphFilter leftFilter, GraphFilter rightFilter)`
    `FilterIntersection` | GraphFilter.`intersect(GraphFilter other)` Intersects this filter with another graph-filter object.
    `FilterUnion` | GraphFilter.`union(GraphFilter other)` Unions this filter with another graph-filter object.

    Constructors in oracle.pgx.api.filter with parameters of type GraphFilter
    Constructor and Description
    `FilterIntersection(GraphFilter leftFilter, GraphFilter rightFilter)` Instantiates a new filter intersection.
    `FilterUnion(GraphFilter leftFilter, GraphFilter rightFilter)` Instantiates a new filter union.

Copyright © 2015. All rights reserved.